An efficient incremental strongly connected components algorithm for evolving directed graphs
نویسندگان
چکیده
منابع مشابه
A space-efficient algorithm for finding strongly connected components
Tarjan’s algorihm for finding the strongly connected components of a directed graph is widely used and acclaimed. His original algorithm required at most v(2 + 5w) bits of storage, where w is the machine’s word size, whilst Nuutila and Soisalon-Soininen reduced this to v(1 + 4w). Many real world applications routinely operate on very large graphs where the storage requirements of such algorithm...
متن کاملVerified Efficient Implementation of Gabow's Strongly Connected Components Algorithm
We present an Isabelle/HOL formalization of Gabow’s algorithm for finding the strongly connected components of a directed graph. Using data refinement techniques, we extract efficient code that performs comparable to a reference implementation in Java. Our style of formalization allows for re-using large parts of the proofs when defining variants of the algorithm. We demonstrate this by verifyi...
متن کاملAn Improved Algorithm for Finding the Strongly Connected Components of a Directed Graph
For a directed graph D = (V,E), a Strongly Connected Component (SCC) is a maximal induced subgraph S = (VS , ES) where, for every x, y ∈ VS , there is a path from x to y (and vice-versa). Tarjan presented a now well-established algorithm for computing the strongly connected components of a digraph in time Θ(v+e) [8]. In the worst case, this needs v(2 + 5w) bits of storage, where w is the machin...
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملFinding strongly connected components in distributed graphs
The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Informationis
سال: 2019
ISSN: 1674-7267
DOI: 10.1360/n112018-00125